l1,1/2 Regularization for Compressive Sensing

نویسندگان

  • Shengcai Liu
  • Jiangshe Zhang
  • Junmin Liu
  • Qingyan Yin
چکیده

Recently, the design of group sparse regularization has drawn much attentions in group sparse signal recovery problem. Two of the most popular group sparsity inducing regularization are the l1,2 and l1,∞ regularization, defined as the sum of l2 and l∞ norms respectively. Nevertheless, they may fail to simultaneously consider the intra-group and intergroup sparsity characteristic of the signal. For example, Huang and Zhang [14] assert that the l1,2 regularization is superior to the l1 regularization only for strongly group-sparse signals. This means the sparsity of intra-group is useless for l1,2 regularization. Our experiments show that recovering signals with intra-group sparse needs more measurements than those without by the l1,∞ regularization. In this paper, we propose a novel group sparsityinducing regularization defined as a mixture of the l1 norm and the l1/2 quasi-norm, referred to as l1,1/2 regularization, which can overcome the above shortcomings of l1,2 and l1,∞ regularization. We define a new null space property for l1,1/2 regularization and apply it to establish a recoverability theory for the both intra-group and inter-group sparse signals. In addition, we introduce an iteratively reweighted algorithm to solve this model, and analyze its convergence. Comprehensive experiments on simulated data show that our proposed l1,1/2 regularization is superior to l1,2 and l1,∞ regularization, especially for the signals with sparsity level low in inter-group and high in intra-group.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Algorithm For Total Variation Regularization with Applications to the Single Pixel Camera and Compressive Sensing

An Efficient Algorithm For Total Variation Regularization with Applications to the Single Pixel Camera and Compressive Sensing

متن کامل

An Efficient Algorithm For Total Variation Regularization with Applications to the Single Pixel Camera and Compressive Sensing by Chengbo Li A

An Efficient Algorithm For Total Variation Regularization with Applications to the Single Pixel Camera and Compressive Sensing

متن کامل

Compressive Sensing for Pan-sharpening

Based on compressive sensing framework and sparse reconstruction technology, a new pan-sharpening method, named Sparse Fusion of Images (SparseFI, pronounced as sparsify), is proposed in [1]. In this paper, the proposed SparseFI algorithm is validated using UltraCam and WorldView-2 data. Visual and statistic analysis show superior performance of SparseFI compared to the existing conventional pa...

متن کامل

Recovery of Seismic Wavefields Based on Compressive Sensing by an l1-Norm Constrained Trust Region Method and the Piecewise Random Sub-sampling

SUMMARY Due to the influence of variations in landform, geophysical data acquisition is usually sub-sampled. Reconstruction of the seismic wavefield from sub-sampled data is an ill-posed inverse problem. Compressive sensing can be used to recover the original geophysical data from the sub-sampled data. In this paper, we consider the wavefield reconstruction problem as a com-pressive sensing and...

متن کامل

A Simple Homotopy Proximal Mapping Algorithm for Compressive Sensing

In this paper, we present a novel yet simple homotopy proximal mapping algorithm for compressive sensing. The algorithm adopts a simple proximal mapping for l1 norm regularization at each iteration and gradually reduces the regularization parameter of the l1 norm. We prove a global linear convergence for the proposed homotopy proximal mapping (HPM) algorithm for solving compressive sensing unde...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014